FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT
نویسندگان
چکیده
منابع مشابه
A Polygraphic Survey on Finiteness Conditions for Rewriting Systems
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he has constructed finitely presented decidable monoids that cannot be presented by finite convergent rewriting systems. In 1994, Squier introduced the condition of finite derivation type, which is a h...
متن کاملFor Rewriting Systems
A finite rewriting system is presented that does not satisfy the homotopical finiteness condition FDT, although it satisfies the homological finiteness condition FHT. This system is obtained from a group G and a finitely generated subgroup H of G through a monoid extension that is almost an HNN-extension. The FHT property of the extension is closely related to the FP2 property for the subgroup ...
متن کاملReportrapport Generalizing Finiteness Conditions of Labelled Transition Systems Generalizing Finiteness Conditions of Labelled Transition Systems
A labelled transition system is provided with some additional structure by endowing the conngurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image...
متن کاملTerm Rewriting Systems as Topological Dynamical Systems
Topological dynamics is, roughly, the study of phenomena related to iterations of continuous maps from a metric space to itself. We show how the rewrite relation in term rewriting gives rise to dynamical systems in two distinct, natural ways: (A) One in which any deterministic rewriting strategy induces a dynamical system on the set of finite and infinite terms endowed with the usual metric, an...
متن کاملGeneralized Finiteness Conditions of Labelled Transition Systems
A labelled transition system is provided with some additional structure by endowing the con gurations and the labels with a complete metric In this way a so called metric labelled transition system is obtained The additional structure on a metric labelled transition systemmakes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2004
ISSN: 0024-6107,1469-7750
DOI: 10.1112/s0024610703004903